482A - Diverse Permutation - CodeForces Solution

#include <bits/stdc++.h>
#include <bitset>
#include <algorithm>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define si set<int>
#define sc set<char>
#define pq priority_queue<long long>
#define lb lower_bound
#define ub upper_bound
#define f(i,s,e) for(long long int i=s;i<e;i++)
#define cf(i,s,e) for(long long int i=s;i<=e;i++)
#define rf(i,e,s) for(long long int i=e-1;i>=s;i--)
#define pb push_back
#define eb emplace_back
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define read(type) readInt<type>()
#define np next_permutation

int main(){
    ll n,k;
    cin>>n>>k;
    for(int i=1;i<=n-k;i++)
    {
        cout<<i<<" ";
    }
    int p=0;
    int a=n;
    int b=n-k+1;
    while(k--)
    {
        if(p%2==0)
        {
            cout<<a<<" ";
            p++;
            a--;
        }
        else
        {
            cout<<b<<" ";
            p++;
            b++;
        }
    }
}